Effect of temperature on biased random walks in disordered media
نویسندگان
چکیده
We study diffusion on an energetically disordered lattice, where each bond between sites is characterized as a random energy barrier. In such a model it had previously been observed that the mean square displacement is sublinear with time at early times, but eventually reaches the classical linear behavior at long times, as a strong function of the temperature. In the current work we add the effect of directional bias in the random walk motion, in which along one axis only, motion in one direction is assigned a higher probability while along the opposite direction a reduced probability. We observe that for low temperatures a ballistic character dominates, as shown by a slope of 2 in the R vs time plot, while at high temperatures the slope reverts to 1, manifesting that the effect of the bias parameter is obliterated. Thus, we show that for a biased random walk diffusion may proceed faster at lower temperatures. The details of how this crossover takes place, and the scaling law of the crossover temperature as a function of the bias are also given. @S1063-651X~97!51207-4#
منابع مشابه
Single Random Walker on Disordered Lattices
Random walks on square lattice percolating clusters were followed for up to 2 • 10 ~ steps. The mean number of distinct sites visited (SN) gives a spectral dimension of d s = 1.30 5:0.03 consistent with superuniversality (d S = 4/3) but closer to the alternative d s = 182/139, based on the low dimensionality correction. Simulations are also given for walkers on an energetically disordered latti...
متن کاملNon-Backtracking Centrality Based Random Walk on Networks
Random walks are a fundamental tool for analyzing realistic complex networked systems and implementing randomized algorithms to solve diverse problems such as searching and sampling. For many real applications, their actual effect and convenience depend on the properties (e.g. stationary distribution and hitting time) of random walks, with biased random walks often outperforming traditional unb...
متن کاملEinstein relation for biased random walk on Galton–Watson trees
We prove the Einstein relation, relating the velocity under a small perturbation to the diffusivity in equilibrium, for certain biased random walks on Galton–Watson trees. This provides the first example where the Einstein relation is proved for motion in random media with arbitrary deep traps.
متن کاملBiased random walks on multiplex networks
Biased random walks on complex networks are a particular type of walks whose motion is biased on properties of the destination node, such as its degree. In recent years they have been exploited to design efficient strategies to explore a network, for instance by constructing maximally mixing trajectories or by sampling homogeneously the nodes. In multiplex networks, the nodes are related throug...
متن کاملMultitarget search on complex networks: A logarithmic growth of global mean random cover time.
We investigate multitarget search on complex networks and derive an exact expression for the mean random cover time that quantifies the expected time a walker needs to visit multiple targets. Based on this, we recover and extend some interesting results of multitarget search on networks. Specifically, we observe the logarithmic increase of the global mean random cover time with the target numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997